#include<stdio.h>
#include<algorithm>
const int N=100005;

int n,a[N];

int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);

	int i,j;
	scanf("%d",&n);

	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);

	std::sort(a+1,a+n+1);
	
	for(i=j=1;i<=n;i++)
	if(j<i&&a[i]>a[j]) j++;
	
	printf("%d\n",n-j+1);
	return 0;
}